Integer linear programming approaches for non-unique probe selection
نویسندگان
چکیده
منابع مشابه
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their ability to assess the presence or absence of biological agents, the targets, in a sample. Given a collection of genetic sequences of targets one faces the challenge of finding short oligonucleotides, the probes, which allow...
متن کاملOptimal robust non-unique probe selection using Integer Linear Programming
MOTIVATION Besides their prevalent use for analyzing gene expression, microarrays are an efficient tool for biological, medical and industrial applications due to their ability to assess the presence or absence of biological agents, the targets, in a sample. Given a collection of genetic sequences of targets one faces the challenge of finding short oligonucleotides, the probes, which allow dete...
متن کاملA Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers
The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...
متن کاملPolyhedral Approaches to Mixed Integer Linear Programming
This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory’s mixed integer cuts.
متن کاملNon-unique Probe Selection with Group Testing
Non-unique probe selection is an important research problem in computational molecular biology. One of approaches to study it is group testing. A minization problem arosen from such study is as follows: Give a binary matrix, find a d-disjunct submatrix with the minimum number of rows and the same number of columns. We give a mini survey on its computational complexityshow and approximation algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.09.021